Fully-Dynamic Graph Algorithms with Sublinear Time Inspired by Distributed Computing
نویسندگان
چکیده
منابع مشابه
Fully Dynamic Maximal Independent Set with Sublinear Update Time
A maximal independent set (MIS) can be maintained in an evolving m-edge graph by simply recomputing it from scratch in O(m) time after each update. But can it be maintained in time sublinear in m in fully dynamic graphs? We answer this fundamental open question in the affirmative. We present a deterministic algorithm with amortized update time O(min{∆,m3/4}), where ∆ is a fixed bound on the max...
متن کاملSublinear Graph Approximation Algorithms
Motivation Want to learn a combinatorial parameter of a graph: the maximum matching size the independence number α(G), the minimum vertex cover size, the minimum dominating set size Krzysztof Onak – Sublinear Graph Approximation Algorithms – p. 2/32 Motivation Want to learn a combinatorial parameter of a graph: the maximum matching size the independence number α(G), the minimum vertex cover siz...
متن کاملSublinear-time Algorithms
In this paper we survey recent advances in the area of sublinear-time algorithms.
متن کاملSublinear Time Algorithms
Sublinear time algorithms represent a new paradigm in computing, where an algorithm must give some sort of an answer after inspecting only a very small portion of the input. We discuss the types of answers that one can hope to achieve in this setting.
متن کاملFully Dynamic Randomized Algorithms for Graph Spanners in Centralized as well as Distributed environments∗
Spanner of an undirected graph G = (V, E) is a sub graph which is sparse and yet preserves all-pairs distances approximately. More formally, a spanner with stretch t ∈ N is a subgraph (V, ES), ES ⊆ E such that the distance between any two vertices in the subgraph is at most t times their distance in G. We present two randomized algorithms for maintaining a sparse t-spanner of an undirected unwe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2017
ISSN: 1877-0509
DOI: 10.1016/j.procs.2017.05.098